TSTP Solution File: SEV413^5 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEV413^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 19:22:27 EDT 2023

% Result   : Theorem 0.20s 0.52s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEV413^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Thu Aug 24 04:05:10 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.20/0.49  %----Proving TH0
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  % File     : SEV413^5 : TPTP v8.1.2. Released v4.0.0.
% 0.20/0.52  % Domain   : Set Theory
% 0.20/0.52  % Problem  : TPS problem from SETS-THMS
% 0.20/0.52  % Version  : Especial.
% 0.20/0.52  % English  :
% 0.20/0.52  
% 0.20/0.52  % Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.52  % Source   : [Bro09]
% 0.20/0.52  % Names    : tps_0852 [Bro09]
% 0.20/0.52  
% 0.20/0.52  % Status   : Theorem
% 0.20/0.52  % Rating   : 0.00 v6.2.0, 0.17 v6.1.0, 0.00 v4.0.0
% 0.20/0.52  % Syntax   : Number of formulae    :    3 (   0 unt;   2 typ;   0 def)
% 0.20/0.52  %            Number of atoms       :    8 (   0 equ;   0 cnn)
% 0.20/0.52  %            Maximal formula atoms :    8 (   8 avg)
% 0.20/0.52  %            Number of connectives :   15 (   0   ~;   1   |;   1   &;   8   @)
% 0.20/0.52  %                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
% 0.20/0.52  %            Maximal formula depth :    6 (   6 avg)
% 0.20/0.52  %            Number of types       :    2 (   0 usr)
% 0.20/0.52  %            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
% 0.20/0.52  %            Number of symbols     :    2 (   2 usr;   0 con; 1-1 aty)
% 0.20/0.52  %            Number of variables   :    4 (   0   ^;   4   !;   0   ?;   4   :)
% 0.20/0.52  % SPC      : TH0_THM_NEQ_NAR
% 0.20/0.52  
% 0.20/0.52  % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.52  %            project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.52  %            Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.52  %            license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  thf(cB,type,
% 0.20/0.52      cB: $i > $o ).
% 0.20/0.52  
% 0.20/0.52  thf(cA,type,
% 0.20/0.52      cA: $i > $o ).
% 0.20/0.52  
% 0.20/0.52  thf(cDUAL_EG5_pme,conjecture,
% 0.20/0.52      ( ( ! [Xx: $i] :
% 0.20/0.52            ( ( cA @ Xx )
% 0.20/0.52           => ( cB @ Xx ) )
% 0.20/0.52        | ! [Xx: $i] :
% 0.20/0.52            ( ( cA @ Xx )
% 0.20/0.52           => ( cB @ Xx ) ) )
% 0.20/0.52     => ( ! [Xx: $i] :
% 0.20/0.52            ( ( cA @ Xx )
% 0.20/0.52           => ( cB @ Xx ) )
% 0.20/0.52        & ! [Xx: $i] :
% 0.20/0.52            ( ( cA @ Xx )
% 0.20/0.52           => ( cB @ Xx ) ) ) ) ).
% 0.20/0.52  
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.9zAgH1yZWE/cvc5---1.0.5_9907.p...
% 0.20/0.52  (declare-sort $$unsorted 0)
% 0.20/0.52  (declare-fun tptp.cB ($$unsorted) Bool)
% 0.20/0.52  (declare-fun tptp.cA ($$unsorted) Bool)
% 0.20/0.52  (assert (not (=> (or (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx)))) (and (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx)))))))
% 0.20/0.52  (set-info :filename cvc5---1.0.5_9907)
% 0.20/0.52  (check-sat-assuming ( true ))
% 0.20/0.52  ------- get file name : TPTP file name is SEV413^5
% 0.20/0.52  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_9907.smt2...
% 0.20/0.52  --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.52  % SZS status Theorem for SEV413^5
% 0.20/0.52  % SZS output start Proof for SEV413^5
% 0.20/0.52  (
% 0.20/0.52  (let ((_let_1 (not (=> (or (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx)))) (and (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (=> (@ tptp.cA Xx) (@ tptp.cB Xx)))))))) (let ((_let_2 (forall ((Xx $$unsorted)) (or (not (ho_3 k_4 Xx)) (ho_3 k_2 Xx))))) (let ((_let_3 (forall ((Xx $$unsorted)) (or (not (ho_3 k_4 Xx)) (ho_3 k_2 Xx))))) (let ((_let_4 (forall ((Xx $$unsorted)) (or (not (ho_3 k_4 Xx)) (ho_3 k_2 Xx))))) (let ((_let_5 (forall ((Xx $$unsorted)) (or (not (ho_3 k_4 Xx)) (ho_3 k_2 Xx))))) (let ((_let_6 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_7 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_8 (not (=> (or _let_2 _let_3) (and _let_4 _let_5))))) (let ((_let_9 (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (=> (or (forall ((Xx $$unsorted)) (or (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (or (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))) (and (forall ((Xx $$unsorted)) (or (not (@ tptp.cA Xx)) (@ tptp.cB Xx))) (forall ((Xx $$unsorted)) (or (not (@ tptp.cA Xx)) (@ tptp.cB Xx)))))) _let_8))))) (PREPROCESS :args ((and _let_7 _let_6)))) :args ((and _let_8 _let_7 _let_6))) :args (0)))) (let ((_let_10 (MACRO_RESOLUTION_TRUST (NOT_AND (NOT_IMPLIES_ELIM2 _let_9)) (EQUIV_ELIM2 (SYMM (ALPHA_EQUIV :args (_let_2 (= Xx Xx))))) (EQUIV_ELIM2 (SYMM (ALPHA_EQUIV :args (_let_2 (= Xx Xx))))) :args ((not _let_2) false _let_5 false _let_4)))) (let ((_let_11 (not _let_3))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (NOT_IMPLIES_ELIM1 _let_9) :args ((or _let_3 _let_2))) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (SYMM (ALPHA_EQUIV :args (_let_2 (= Xx Xx))))) :args ((or _let_2 _let_11))) _let_10 :args (_let_11 true _let_2)) _let_10 :args (false true _let_3 true _let_2)) :args (_let_1 true))))))))))))))
% 0.20/0.53  )
% 0.20/0.53  % SZS output end Proof for SEV413^5
% 0.20/0.53  % cvc5---1.0.5 exiting
% 0.20/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------